Multigrid methods for some quasi-variational inequalities
نویسندگان
چکیده
منابع مشابه
Multigrid methods for variational inequalities
In this paper we introduce four multigrid algorithms for the constrained minimization of non-quadratic functionals. The algorithm introduced in [L. Badea, Convergence rate of a Schwarz multilevel method for the constrained minimization of non-quadratic functionals, SIAM J. Numer. Anal., 44, 2, 2006, p. 449-477], has a sub-optimal computing complexity because the convex set, which is defined on ...
متن کاملSome new projection methods for variational inequalities
In this paper, we propose some new double-projection methods for solving variational inequalities by using the Wiener–Hopf equations technique. It is shown that these methods converge linearly under mild conditions and include some existing projection methods as special cases. Some examples are given to illustrate the efficiency of the proposed methods. 2002 Elsevier Science Inc. All rights res...
متن کاملMultigrid Methods with Constraint Level Decomposition for Variational Inequalities∗
In this paper we introduce four multigrid algorithms for the constrained minimization of non-quadratic functionals. These algorithms are combinations of additive or multiplicative iterations on levels with additive or multiplicative ones over the levels. The convex set is decomposed as a sum of convex level subsets, and consequently, the algorithms have an optimal computing complexity. The meth...
متن کاملMonotone Multigrid Methods for Elliptic Variational Inequalities Ii
We derive fast solvers for discrete elliptic variational inequalities of the second kind as resulting from the approximation by piecewise linear nite elements. Following the rst part of this paper, monotone multigrid methods are considered as extended underrelaxations. Again, the coarse grid corrections are localized by suitable constraints, which in this case are xed by ne grid smoothing. We c...
متن کاملMonotone Multigrid Methods for Elliptic Variational Inequalities I
We derive fast solvers for discrete elliptic variational inequalities of the rst kind (obstacle problems) as resulting from the approximation of related continuous problems by piecewise linear nite elements. Using basic ideas of successive subspace correction, we modify well-known relaxation methods by extending the set of search directions. Extended underrelaxations are called monotone multigr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Continuous Dynamical Systems - Series S
سال: 2013
ISSN: 1937-1632
DOI: 10.3934/dcdss.2013.6.1457